Sciweavers

1263 search results - page 45 / 253
» A* with Bounded Costs
Sort
View
MICS
2008
63views more  MICS 2008»
14 years 9 months ago
Unambiguous Automata
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
Marie-Pierre Béal, Eugen Czeizler, Jarkko K...
DEDS
2002
86views more  DEDS 2002»
14 years 9 months ago
On an Optimization Problem in Sensor Selection*
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cos...
Rami Debouk, Stéphane Lafortune, Demostheni...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
15 years 3 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 1 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin