Sciweavers

1068 search results - page 141 / 214
» On Space Bounded Server Algorithms
Sort
View
SCL
2008
76views more  SCL 2008»
13 years 7 months ago
Probabilistic output admissible set for systems with time-varying uncertainties
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial ...
Takeshi Hatanaka, Kiyotsugu Takaba
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
WWW
2004
ACM
14 years 8 months ago
Experiments with persian text compression for web
The increasing importance of Unicode for text encoding implies a possible doubling of data storage space and data transmission time, with a corresponding need for data compression...
Farhad Oroumchian, Ehsan Darrudi, Fattane Taghiyar...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 8 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...