Sciweavers

2079 search results - page 398 / 416
» Universality of random graphs
Sort
View
94
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
92
Voted
VISUALIZATION
2005
IEEE
15 years 5 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...
ICWL
2004
Springer
15 years 5 months ago
Learning Algorithms with an Electronic Chalkboard over the Web
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...
Margarita Esponda Argüero, Raúl Rojas
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
15 years 5 months ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz
MOBICOM
2003
ACM
15 years 5 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano