Sciweavers

2127 search results - page 174 / 426
» Computing large matchings fast
Sort
View
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
16 years 5 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICDIM
2007
IEEE
15 years 10 months ago
Fast encounter-based synchronization for mobile devices
The large and growing number of computing devices used by individuals has caused the challenges of distributed storage to take on increased importance. In addition to desktops and...
Daniel Peek, Douglas B. Terry, Venugopalan Ramasub...
ICPADS
2006
IEEE
15 years 10 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
CEC
2005
IEEE
15 years 10 months ago
Fast evolution of custom machine representations
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...
Lorenz Huelsbergen
IFIP
1999
Springer
15 years 8 months ago
Frontier: A Fast Placement System for FPGAs
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
Russell Tessier