Sciweavers

613 search results - page 70 / 123
» Time Optimal Self-Stabilizing Spanning Tree Algorithms
Sort
View
PPOPP
2011
ACM
14 years 18 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
FOCS
2006
IEEE
15 years 3 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
BIBE
2006
IEEE
119views Bioinformatics» more  BIBE 2006»
15 years 3 months ago
Large Grain Size Stochastic Optimization Alignment
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
Perry Ridge, Hyrum Carroll, Dan Sneddon, Mark J. C...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
ICDAR
2003
IEEE
15 years 3 months ago
Binary Classification Trees for Multi-class Classification Problems
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
Jin-Seon Lee, Il-Seok Oh