Sciweavers

4926 search results - page 602 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
128
Voted
ERSHOV
2006
Springer
15 years 6 months ago
A Versioning and Evolution Framework for RDF Knowledge Bases
We present an approach to support the evolution of online, distributed, reusable, and extendable ontologies based on the RDF data model. The approach works on the basis of atomic c...
Sören Auer, Heinrich Herre
123
Voted
WSNA
2003
ACM
15 years 7 months ago
Analyzing and modeling encryption overhead for sensor network nodes
Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in...
Prasanth Ganesan, Ramnath Venugopalan, Pushkin Ped...
140
Voted
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
16 years 3 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
148
Voted
DAC
2003
ACM
16 years 3 months ago
Data communication estimation and reduction for reconfigurable systems
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
Adam Kaplan, Philip Brisk, Ryan Kastner
117
Voted
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 3 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald