Sciweavers

2526 search results - page 350 / 506
» A New Algorithm for Answer Set Computation
Sort
View
137
Voted
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 6 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
125
Voted
IJCAI
2007
15 years 4 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
138
Voted
NIPS
2004
15 years 4 months ago
Parametric Embedding for Class Visualization
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
Tomoharu Iwata, Kazumi Saito, Naonori Ueda, Sean S...
98
Voted
TPDS
1998
98views more  TPDS 1998»
15 years 2 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 7 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook