Sciweavers

10493 search results - page 1578 / 2099
» Dynamic Word Problems
Sort
View
125
Voted
ICDT
2005
ACM
88views Database» more  ICDT 2005»
15 years 10 months ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
150
Voted
INDOCRYPT
2004
Springer
15 years 10 months ago
New ID-Based Threshold Signature Scheme from Bilinear Pairings
ID-based public key systems allow the user to use his/her identity as the public key, which can simplify key management procedure compared with CA-based public key systems. However...
Xiaofeng Chen, Fangguo Zhang, Divyan M. Konidala, ...
FOCS
2002
IEEE
15 years 9 months ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan
147
Voted
LSSC
2001
Springer
15 years 9 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
136
Voted
ICCVW
1999
Springer
15 years 8 months ago
Optimization Criteria, Sensitivity and Robustness of Motion and Structure Estimation
The prevailing efforts to study the standard formulation of motion and structure recovery have been recently focused on issues of sensitivity and and robustness of existing techn...
Jana Kosecka, Yi Ma, Shankar Sastry
« Prev « First page 1578 / 2099 Last » Next »