Sciweavers

973 search results - page 169 / 195
» New Bounds on Crossing Numbers
Sort
View
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
13 years 10 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
ADHOC
2006
116views more  ADHOC 2006»
13 years 8 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
COR
2007
134views more  COR 2007»
13 years 8 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
TKDE
2008
136views more  TKDE 2008»
13 years 8 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
JACM
2000
81views more  JACM 2000»
13 years 8 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin