Sciweavers

201 search results - page 36 / 41
» Incremental Algorithms for Approximate Compilation
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
SIGGRAPH
1997
ACM
14 years 2 days ago
View-dependent refinement of progressive meshes
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...
Hugues Hoppe
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
14 years 1 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
LREC
2008
112views Education» more  LREC 2008»
13 years 10 months ago
A Ground Truth Dataset for Matching Culturally Diverse Romanized Person Names
This paper describes the development of a ground truth dataset of culturally diverse Romanized names in which approximately 70,000 names are matched against a subset of 700. We ra...
Mark Arehart, Keith J. Miller
WWW
2009
ACM
14 years 9 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel