Sciweavers

3223 search results - page 634 / 645
» The Scaling of Search Cost
Sort
View
CICLING
2008
Springer
13 years 10 months ago
Unsupervised and Knowledge-Free Learning of Compound Splits and Periphrases
Abstract. We present an approach for knowledge-free and unsupervised recognition of compound nouns for languages that use one-wordcompounds such as Germanic and Scandinavian langua...
Florian Holz, Chris Biemann
DAC
2005
ACM
13 years 10 months ago
Constraint-aware robustness insertion for optimal noise-tolerance enhancement in VLSI circuits
Reliability of nanometer circuits is becoming a major concern in today’s VLSI chip design due to interferences from multiple noise sources as well as radiation-induced soft erro...
Chong Zhao, Yi Zhao, Sujit Dey
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
13 years 9 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
NSDI
2010
13 years 9 months ago
WebProphet: Automating Performance Prediction for Web Services
Today, large-scale web services run on complex systems, spanning multiple data centers and content distribution networks, with performance depending on diverse factors in end syst...
Zhichun Li, Ming Zhang, Zhaosheng Zhu, Yan Chen, A...
GRAPHICSINTERFACE
2008
13 years 9 months ago
Quality scalability of soft shadow mapping
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...
Michael Schwarz, Marc Stamminger