Sciweavers

1452 search results - page 226 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
COMPUTER
1999
69views more  COMPUTER 1999»
15 years 15 days ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
116
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 1 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
90
Voted
DAC
2005
ACM
16 years 1 months ago
IODINE: a tool to automatically infer dynamic invariants for hardware designs
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis. A practical bottleneck in the formal verification of hardware designs is the n...
Sudheendra Hangal, Naveen Chandra, Sridhar Narayan...
191
Voted
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
16 years 1 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik