Result 1 to 20 of 52 total
Confluent drawing algorithms using rectangular dualization. (English)
Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 341-352 (2011).
1
Agents and ontologies for understanding and preserving the rock art of mount bego (English)
ICAART (2), 288-295 (2011).
2
Confluent drawing algorithms using rectangular dualization (English)
Graph Drawing, 341-352 (2010).
3
io-port 50121425 Boos, J. Brad;
Bennett, Brian R.;
Papanicolaou, Nicolas A.;
Ancona, Mario G.;
Champlain, James G.;
Chou, Yeong-Chang;
Lange, Michael D.;
Yang, Jeffrey M.;
Bass, Robert;
Park, Doewon;
Shanabrook, Ben V.
Sb-based n- and p-channel heterostructure fets for high-speed, low-power applications (English)
IEICE Transactions 91-C, No. 7, 1050-1057 (2008).
4
Rpython: a step towards reconciling dynamically and statically typed OO languages (English)
DLS, 53-64 (2007).
5
Attention-aware cultural heritage applications on mobile phones (English)
WOWMOM, 1-8 (2007).
6
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions (English)
ACSC, 25-33 (2007).
7
Design-based pointcuts robustness against software evolution (English)
RAM-SE, 35-45 (2006).
8
Visualizing and managing network topologies via rectangular dualization (English)
ISCC, 1000-1005 (2006).
9
AOP for software evolution: a design oriented approach (English)
SAC, 1346-1350 (2005).
10
Role of image recognition in defining the user’s in 3G phone applications: the AGAMEMNON experience (English)
ICIP (3), 1012-1015 (2005).
11
The role of design information in software evolution (English)
RAM-SE, 59-72 (2005).
12
Implementing the essence of reflection: a reflective run-time environment (English)
SAC, 1503-1507 (2004).
13
Evolving pointcut definition to get software evolution (English)
RAM-SE, 83-88 (2004).
14
Smart data caching in archeological wireless applications: the PAST solution (English)
PDP, 532-536 (2003).
15
Clustering algorithms for the optimization of communication graphs. (English)
Martínez Morera, Dimas (ed.) et al., VIth symposium of mathematics, international conference, CIMAF 2001. Proceedings of the fourth Italian-Latin American conference on applied and industrial mathematics (ITLA), Havana, Cuba, March 19-23, 2001. Havana: Institute of Cybernetics, Mathematics and Physics (ICIMAF). 328-334 (2001).
16
Context and location aware textual data input (English)
SAC, 425-428 (2001).
17
Mobile computing in a hospital: the WARD-IN-HAND project (English)
SAC (2), 554-556 (2000).
18
All separating triangles in a plane graph can be optimally “broken” in polynomial time. (English)
Widmayer, Peter (ed.) et al., Graph theoretic concepts in computer science. 25th international workshop, WG ’99, Ascona, Switzerland, June 17-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1665, 278-290 (1999).
19
All separating triangles in a plane graph can be optimally "broken" in polynomial time (English)
WG, 278-290 (1999).
20
Result 1 to 20 of 52 total
Start
Contact
Print
General Help
