Sciweavers

2681 search results - page 215 / 537
» Problem F
Sort
View
137
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 26 days ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
102
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
125
Voted
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 6 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
131
Voted
COLT
2008
Springer
15 years 2 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
SIAMSC
2010
130views more  SIAMSC 2010»
14 years 11 months ago
First-Order System Least Squares for Incompressible Resistive Magnetohydrodynamics
Magnetohydrodynamics (MHD) is a fluid theory that describes Plasma Physics by treating the plasma as a fluid of charged particles. Hence, the equations that describe the plasma f...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...