Sciweavers

2383 search results - page 46 / 477
» Finding Representative Set from Massive Data
Sort
View
VMCAI
2009
Springer
15 years 4 months ago
Finding Concurrency-Related Bugs Using Random Isolation
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
Nicholas Kidd, Thomas W. Reps, Julian Dolby, Manda...
PAKM
2004
14 years 11 months ago
Automatic Generation of Taxonomies from the WWW
In this paper we present a methodology to extract information from the Web to build a taxonomy of terms and Web resources for a given domain. This taxonomy represents a hierarchy o...
David Sánchez, Antonio Moreno
DGO
2000
91views Education» more  DGO 2000»
14 years 11 months ago
Simplifying data access: the energy data collection (EDC) project
The massive amount of statistical and text data available from government agencies has created a set of daunting challenges to both research and analysis communities. These proble...
José Luis Ambite, Yigal Arens, Luis Gravano...
ICML
2004
IEEE
15 years 10 months ago
Learning first-order rules from data with multiple parts: applications on mining chemical compound data
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
Cholwich Nattee, Sukree Sinthupinyo, Masayuki Numa...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera