Sciweavers

1090 search results - page 32 / 218
» Problem Dependent Generalized Prewavelets
Sort
View
ISSTA
2009
ACM
14 years 3 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 3 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
MDAI
2009
Springer
14 years 3 months ago
Using Conditional Random Fields for Decision-Theoretic Planning
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
Paul A. Ardis, Christopher M. Brown
COCOON
1998
Springer
14 years 1 months ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
COMPGEOM
1994
ACM
14 years 1 months ago
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
Dan Halperin, Micha Sharir