Sciweavers

514 search results - page 72 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 28 days ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ICPP
1994
IEEE
14 years 25 days ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 17 days ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
LREC
2010
166views Education» more  LREC 2010»
13 years 10 months ago
Learning Based Java for Rapid Development of NLP Systems
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...
Nick Rizzolo, Dan Roth
TIT
2008
147views more  TIT 2008»
13 years 8 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...