Sciweavers

1521 search results - page 74 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
EDOC
2003
IEEE
15 years 8 months ago
An Efficient, Scalable Content-Based Messaging System
Large-scale information processing environments must rapidly search through massive streams of raw data to locate useful information. These data streams contain textual and numeri...
Ian Gorton, Justin Almquist, Nick Cramer, Jereme H...
PPOPP
2011
ACM
14 years 6 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
BMCBI
2008
103views more  BMCBI 2008»
15 years 3 months ago
Parameter estimation for robust HMM analysis of ChIP-chip data
Background: Tiling arrays are an important tool for the study of transcriptional activity, proteinDNA interactions and chromatin structure on a genome-wide scale at high resolutio...
Peter Humburg, David Bulger, Glenn Stone
JMLR
2008
159views more  JMLR 2008»
15 years 3 months ago
Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction
Existing template-independent web data extraction approaches adopt highly ineffective decoupled strategies--attempting to do data record detection and attribute labeling in two se...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
15 years 4 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...