Sciweavers

448 search results - page 81 / 90
» Dynamic Algorithms for the Dyck Languages
Sort
View
74
Voted
AAAI
2011
13 years 9 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...
KDD
2005
ACM
192views Data Mining» more  KDD 2005»
15 years 10 months ago
Modeling and predicting personal information dissemination behavior
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...
Xiaodan Song, Ching-Yung Lin, Belle L. Tseng, Ming...
POPL
2005
ACM
15 years 10 months ago
Synthesis of interface specifications for Java classes
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
P. Madhusudan, Pavol Cerný, Rajeev Alur, Wo...
HPDC
2009
IEEE
15 years 4 months ago
TakTuk, adaptive deployment of remote executions
This article deals with TakTuk, a middleware that deploys efficiently parallel remote executions on large scale grids (thousands of nodes). This tool is mostly intended for intera...
Benoit Claudel, Guillaume Huard, Olivier Richard
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie