Sciweavers

1998 search results - page 399 / 400
» Complexity of the Cover Polynomial
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 5 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
PAMI
2012
12 years 7 days ago
Recursive Segmentation and Recognition Templates for Image Parsing
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
Long Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan...
FOCS
2008
IEEE
14 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
COMPGEOM
2010
ACM
14 years 2 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
BMCBI
2010
137views more  BMCBI 2010»
13 years 10 months ago
TassDB2 - A comprehensive database of subtle alternative splicing events
Background: Subtle alternative splicing events involving tandem splice sites separated by a short (2-12 nucleotides) distance are frequent and evolutionarily widespread in eukaryo...
Rileen Sinha, Thorsten Lenser, Niels Jahn, Ulrike ...