Sciweavers

996 search results - page 68 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
166
Voted
ICML
2003
IEEE
16 years 8 months ago
Text Bundling: Statistics Based Data-Reduction
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
Lawrence Shih, Jason D. Rennie, Yu-Han Chang, Davi...
196
Voted
IPPS
2002
IEEE
16 years 18 days ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
16 years 1 months ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert
231
Voted
PCM
2001
Springer
139views Multimedia» more  PCM 2001»
16 years 3 days ago
Fast and Robust Sprite Generation for MPEG-4 Video Coding
This paper presents a fast and robust sprite generation algorithm for MPEG-4 video coding. Our contributions consist of two aspects. Firstly, a fast and robust Global Motion Estima...
Yan Lu, Wen Gao, Feng Wu
225
Voted
ATAL
2010
Springer
15 years 8 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein