Sciweavers

20441 search results - page 128 / 4089
» Locally Computable Structures
Sort
View
CGF
2008
153views more  CGF 2008»
13 years 10 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 9 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
E2EMON
2006
IEEE
14 years 4 months ago
Active Probing Approach for Fault Localization in Computer Networks
—Active probing is an active network monitoring technique that has potential for developing effective solutions for fault localization. In this paper we use active probing to pre...
Maitreya Natu, Adarshpal S. Sethi
ENTCS
2008
76views more  ENTCS 2008»
13 years 10 months ago
Computable Riesz Representation for Locally Compact Hausdorff Spaces
: By the Riesz Representation Theorem for locally compact Hausdorff spaces, for every positive linear functional I on K(X) there is a measure
Hong Lu, Klaus Weihrauch
IPPS
2007
IEEE
14 years 4 months ago
Local Scheduling for Volunteer Computing
BOINC, a middleware system for volunteer computing, involves projects, which distribute jobs, and hosts, which execute jobs. The local (host-level) scheduler addresses two issues:...
David P. Anderson, John McLeod