Sciweavers

373 search results - page 58 / 75
» Counting in Trees for Free
Sort
View
FSTTCS
1995
Springer
14 years 7 days ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 10 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
JUCS
2007
112views more  JUCS 2007»
13 years 8 months ago
Internet Path Behavior Prediction via Data Mining: Conceptual Framework and Case Study
: In this paper we propose an application of data mining methods in the prediction of the availability and performance of Internet paths. We deploy a general decision-making method...
Leszek Borzemski
ACL
2009
13 years 6 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning
ISCA
2011
IEEE
229views Hardware» more  ISCA 2011»
13 years 12 days ago
TLSync: support for multiple fast barriers using on-chip transmission lines
As the number of cores on a single-chip grows, scalable barrier synchronization becomes increasingly difficult to implement. In software implementations, such as the tournament ba...
Jungju Oh, Milos Prvulovic, Alenka G. Zajic