Sciweavers

419 search results - page 76 / 84
» Three Case Studies of Large-Scale Data Flows
Sort
View
BMCBI
2010
85views more  BMCBI 2010»
14 years 9 months ago
Robust test method for time-course microarray experiments
Background: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectorie...
Insuk Sohn, Kouros Owzar, Stephen L. George, Sujon...
COMPGEOM
2009
ACM
15 years 4 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
HRI
2006
ACM
15 years 3 months ago
Interaction debugging: an integral approach to analyze human-robot interaction
Along with the development of interactive robots, controlled experiments and field trials are regularly conducted to stage human-robot interaction. Experience in this field has sh...
Tijn Kooijmans, Takayuki Kanda, Christoph Bartneck...
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 1 months ago
How schema independent are schema free query interfaces?
— Real-world databases often have extremely complex schemas. With thousands of entity types and relationships, each with a hundred or so attributes, it is extremely difficult fo...
Arash Termehchy, Marianne Winslett, Yodsawalai Cho...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
15 years 3 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen