Sciweavers

1034 search results - page 189 / 207
» Importance-Driven Focus of Attention
Sort
View
ICSE
2004
IEEE-ACM
14 years 10 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 9 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
WSDM
2010
ACM
227views Data Mining» more  WSDM 2010»
14 years 7 months ago
Folks in folksonomies: Social link prediction from shared metadata
Web 2.0 applications have attracted a considerable amount of attention because their open-ended nature allows users to create lightweight semantic scaffolding to organize and shar...
Rossano Schifanella, Alain Barrat, Ciro Cattuto, B...
PLDI
2010
ACM
14 years 7 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
SOFSEM
2010
Springer
14 years 6 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour