137 search results - page 24 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
BSL
2000
13 years 7 months ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...