Sciweavers

274 search results - page 38 / 55
» An Alternative to Deep Case for Representing Relational Info...
Sort
View
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
CAV
2007
Springer
108views Hardware» more  CAV 2007»
14 years 2 months ago
Systematic Acceleration in Regular Model Checking
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Bengt Jonsson, Mayank Saksena
INFOCOM
2011
IEEE
12 years 11 months ago
Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd
—Opportunistic ad-hoc communication enables portable devices such as smartphones to effectively exchange information, taking advantage of their mobility and locality. The nature ...
Gjergji Zyba, Geoffrey M. Voelker, Stratis Ioannid...
ICC
2009
IEEE
106views Communications» more  ICC 2009»
14 years 2 months ago
Distributed ECN-Based Congestion Control
—Following the design philosophy of XCP, VCP is a router-assisted congestion protocol that intends to balance the efficiency and the fairness control in high Bandwidth-Delay Pro...
Xiaolong Li, Homayoun Yousefi'zadeh
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 8 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau