Sciweavers

5221 search results - page 978 / 1045
» An On-line Problem Database
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
ICAPR
2005
Springer
14 years 2 months ago
Fingerprint Image Enhancement Using STFT Analysis
Contrary to popular belief, despite decades of research in fingerprints, reliable fingerprint recognition is an open problem. Extracting features out of poor quality prints is t...
Sharat Chikkerur, Venu Govindaraju, Alexander N. C...
MM
2004
ACM
192views Multimedia» more  MM 2004»
14 years 2 months ago
Communicating everyday experiences
In this paper, we present our approach to the problem of communicating everyday experiences. This is a challenging problem, since media from everyday events are unstructured, and ...
Preetha Appan, Hari Sundaram, David Birchfield
ATAL
2003
Springer
14 years 2 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
CIKM
2003
Springer
14 years 2 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun