Sciweavers

8294 search results - page 379 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
MTA
2011
219views Hardware» more  MTA 2011»
15 years 1 months ago
Network-adaptive autonomic transcoding algorithm for seamless streaming media service of mobile clients
As a result of improvements in wireless communication technologies, a multimedia data streaming service can now be provided for mobile clients. Since mobile devices have low comput...
Dongmahn Seo, Inbum Jung
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
16 years 9 days ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
16 years 3 days ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 10 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic