Sciweavers

2127 search results - page 378 / 426
» Computing large matchings fast
Sort
View
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 5 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 5 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
ICARCV
2002
IEEE
166views Robotics» more  ICARCV 2002»
15 years 4 months ago
Similarity measure determination from NURBS-warping method
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
Kim Meng Liang, Mandava Rajeswari, Bee Ee Khoo
FCCM
1998
IEEE
107views VLSI» more  FCCM 1998»
15 years 4 months ago
Frequency-Domain Sonar Processing in FPGAs and DSPs
Over the past year we have been exploring the use of FPGA-based custom computing machines for several sonar beamforming applications, including time-domain beamforming[1], frequen...
Paul Graham, Brent E. Nelson
BMCBI
2007
164views more  BMCBI 2007»
14 years 12 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason