Sciweavers

1202 search results - page 58 / 241
» Sortings for Reactive Systems
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
14 years 11 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
FOCS
2004
IEEE
15 years 3 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
PODS
2005
ACM
164views Database» more  PODS 2005»
15 years 12 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
108
Voted
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
15 years 9 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
DAGSTUHL
2003
15 years 1 months ago
Some Methodological Observations Resulting from Experience Using LSCs and the Play-In/Play-Out Approach
The play-in/play-out approach is a method for specifying and developing complex reactive systems. It is built upon a scenariobased philosophy, and uses the language of live sequenc...
David Harel, Hillel Kugler, Gera Weiss