Sciweavers

2087 search results - page 39 / 418
» Computation of class numbers of quadratic number fields
Sort
View
ACL
2010
13 years 6 months ago
Practical Very Large Scale CRFs
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
Thomas Lavergne, Olivier Cappé, Franç...
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 8 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
MFCS
2007
Springer
14 years 2 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
QEST
2010
IEEE
13 years 6 months ago
Automating the Mean-Field Method for Large Dynamic Gossip Networks
Abstract--We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us ...
Rena Bakhshi, Jörg Endrullis, Stefan Endrulli...
MOC
2000
111views more  MOC 2000»
13 years 8 months ago
Voronoi's algorithm in purely cubic congruence function fields of unit rank 1
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
Renate Scheidler, Andreas Stein