Sciweavers

413 search results - page 38 / 83
» On space constrained set selection problems
Sort
View
CORR
2010
Springer
72views Education» more  CORR 2010»
14 years 9 months ago
X-Armed Bandits
We consider a generalization of stochastic bandit problems where the set of arms, X, is allowed to be a generic topological space. We constraint the mean-payoff function with a di...
Sébastien Bubeck, Rémi Munos, Gilles...
112
Voted
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 18 days ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
ISPD
2003
ACM
171views Hardware» more  ISPD 2003»
15 years 5 months ago
Timing driven force directed placement with physical net constraints
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...
Karthik Rajagopal, Tal Shaked, Yegna Parasuram, Tu...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 4 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
116
Voted
DKE
1999
118views more  DKE 1999»
15 years 3 days ago
Designing Data Warehouses
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
Dimitri Theodoratos, Timos K. Sellis