Sciweavers

3818 search results - page 642 / 764
» Learning from Order Examples
Sort
View
WWW
2005
ACM
16 years 7 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
ESWS
2007
Springer
16 years 15 days ago
A Performance and Scalability Metric for Virtual RDF Graphs
Abstract. From a theoretical point of view, the Semantic Web is understood in terms of a stack with RDF being one of its layers. A Semantic Web application operates on the common d...
Michael Hausenblas, Wolfgang Slany, Danny Ayers
IOLTS
2005
IEEE
163views Hardware» more  IOLTS 2005»
15 years 12 months ago
Modeling Soft-Error Susceptibility for IP Blocks
As device geometries continue to shrink, single event upsets are becoming of concern to a wider spectrum of system designers. These “soft errors” can be a nuisance or catastro...
Robert C. Aitken, Betina Hold
BMCBI
2008
111views more  BMCBI 2008»
15 years 6 months ago
SciDBMaker: new software for computer-aided design of specialized biological databases
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
Riadh Hammami, Abdelmajid Zouhir, Karim Naghmouchi...
ALGORITHMICA
2011
15 years 1 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick