Sciweavers

619 search results - page 111 / 124
» Random Bichromatic Matchings
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...
GIS
2005
ACM
14 years 9 months ago
Automatic extraction of road intersections from raster maps
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
Yao-Yi Chiang, Craig A. Knoblock, Ching-Chien Chen
WWW
2008
ACM
14 years 9 months ago
Mining, indexing, and searching for textual chemical molecule information on the web
Current search engines do not support user searches for chemical entities (chemical names and formulae) beyond simple keyword searches. Usually a chemical molecule can be represen...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
WWW
2007
ACM
14 years 9 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos