Sciweavers

2272 search results - page 176 / 455
» Capture Complexity by Partition
Sort
View
152
Voted
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
14 years 10 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo
IPL
2011
91views more  IPL 2011»
14 years 6 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
146
Voted
WWW
2008
ACM
16 years 4 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
EMSOFT
2009
Springer
15 years 10 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
154
Voted
IWCIA
2009
Springer
15 years 10 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...