Sciweavers

4541 search results - page 170 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
PLDI
2011
ACM
14 years 6 months ago
EnerJ: approximate data types for safe and general low-power computation
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
Adrian Sampson, Werner Dietl, Emily Fortuna, Danus...
RECOMB
2005
Springer
16 years 3 months ago
Predicting Transcription Factor Binding Sites Using Structural Knowledge
Abstract. Current approaches for identification and detection of transcription factor binding sites rely on an extensive set of known target genes. Here we describe a novel structu...
Tommy Kaplan, Nir Friedman, Hanah Margalit
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...
105
Voted
ESA
2008
Springer
73views Algorithms» more  ESA 2008»
15 years 4 months ago
On the Size of the 3D Visibility Skeleton: Experimental Results
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Chri...
SEMWEB
2009
Springer
15 years 9 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker