Sciweavers

1529 search results - page 50 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
FOCS
2008
IEEE
14 years 2 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
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
14 years 1 months ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...
WCE
2007
13 years 8 months ago
Face Recognition using Discrete Cosine Transform plus Linear Discriminant Analysis
—Face recognition is a biometric identification method which among the other methods such as, finger print identification, speech recognition, signature and hand written recognit...
M. Hajiarbabi, J. Askari, S. Sadri, M. Saraee
PODC
2010
ACM
13 years 11 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 7 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...