Sciweavers

5624 search results - page 278 / 1125
» On Conditional Covering Problem
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 6 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
SDM
2009
SIAM
125views Data Mining» more  SDM 2009»
16 years 3 months ago
Providing Privacy through Plausibly Deniable Search.
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
Chris Clifton, Mummoorthy Murugesan
APN
2007
Springer
16 years 26 days ago
Nets with Tokens Which Carry Data
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
Ranko Lazic, Thomas Christopher Newcomb, Joël...
FASE
2007
Springer
16 years 25 days ago
EQ-Mine: Predicting Short-Term Defects for Software Evolution
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...
Jacek Ratzinger, Martin Pinzger, Harald Gall
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
16 years 25 days ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn