Sciweavers

1999 search results - page 86 / 400
» Finding Reductions Automatically
Sort
View
POPL
2006
ACM
15 years 10 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
MUE
2007
IEEE
190views Multimedia» more  MUE 2007»
15 years 4 months ago
On Clustering Multimedia Time Series Data Using K-Means and Dynamic Time Warping
After the generation of multimedia data turned digital, an explosion of interest in their data storage, retrieval, and processing has drastically increased. This includes videos, ...
Vit Niennattrakul, Chotirat Ann Ratanamahatana
DM
2006
128views more  DM 2006»
14 years 10 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 7 months ago
Cause Clue Clauses: Error Localization using Maximum Satisfiability
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
Manu Jose, Rupak Majumdar
ECOOP
2012
Springer
13 years 9 days ago
Static Detection of Loop-Invariant Data Structures
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
Guoqing (Harry) Xu, Dacong Yan, Atanas Rountev