Sciweavers

1174 search results - page 172 / 235
» Functional Trees
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
ESOP
2008
Springer
13 years 11 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
COMPUTER
1998
131views more  COMPUTER 1998»
13 years 9 months ago
Windows NT Clustering Service
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
Rod Gamache, Rob Short, Mike Massa
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 7 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 5 months ago
A supervised clustering approach for fMRI-based inference of brain states
We propose a method that combines signals from many brain regions observed in functional Magnetic Resonance Imaging (fMRI) to predict the subject’s behavior during a scanning se...
Vincent Michel, Alexandre Gramfort, Gaël Varo...