Sciweavers

8294 search results - page 309 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
VLDB
2007
ACM
119views Database» more  VLDB 2007»
16 years 6 months ago
Dynamic Workload Management for Very Large Data Warehouses: Juggling Feathers and Bowling Balls
Workload management for business intelligence (BI) queries poses different challenges than those addressed in the online transaction processing (OLTP) context. The fundamental pro...
Stefan Krompass, Umeshwar Dayal, Harumi A. Kuno, A...
BMCBI
2006
123views more  BMCBI 2006»
15 years 6 months ago
Characterizing disease states from topological properties of transcriptional regulatory networks
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...
David Tuck, Harriet Kluger, Yuval Kluger
PR
2010
163views more  PR 2010»
15 years 5 months ago
A comparative evaluation of interactive segmentation algorithms
In this paper we present a comparative evaluation of four popular interactive segmentation algorithms. The evaluation was carried out as a series of user-experiments, in which par...
Kevin McGuinness, Noel E. O'Connor
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 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
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
15 years 11 months ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...