Sciweavers

1412 search results - page 243 / 283
» types 2004
Sort
View
FOCS
2005
IEEE
15 years 11 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
166
Voted
TCC
2005
Springer
116views Cryptology» more  TCC 2005»
15 years 11 months ago
Error Correction in the Bounded Storage Model
We initiate a study of Maurer’s bounded storage model (JoC, 1992) in presence of transmission errors and perhaps other types of errors that cause different parties to have incon...
Yan Zong Ding
VRST
2004
ACM
15 years 11 months ago
The MORGAN framework: enabling dynamic multi-user AR and VR projects
The availability of a suitable framework is of vital importance for the development of Augmented Reality (AR) and Virtual Reality (VR) projects. While features such as scalability...
Jan Ohlenburg, Iris Herbst, Irma Lindt, Torsten Fr...
201
Voted
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 11 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 11 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi