Sciweavers

9631 search results - page 150 / 1927
» The Costs of Using JXTA
Sort
View
IPTPS
2004
Springer
15 years 12 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
ACL
2006
15 years 8 months ago
Improving the Scalability of Semi-Markov Conditional Random Fields for Named Entity Recognition
This paper presents techniques to apply semi-CRFs to Named Entity Recognition tasks with a tractable computational cost. Our framework can handle an NER task that has long named e...
Daisuke Okanohara, Yusuke Miyao, Yoshimasa Tsuruok...
JC
2000
45views more  JC 2000»
15 years 6 months ago
What Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
Arthur G. Werschulz
IJCGA
2002
69views more  IJCGA 2002»
15 years 6 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers
MICCAI
2010
Springer
15 years 5 months ago
Reconstructing Geometrically Consistent Tree Structures from Noisy Images
Abstract. We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bif...
Engin Türetken, Christian Blum, Germán...