Sciweavers

2200 search results - page 420 / 440
» Bloch's Constant is Computable
Sort
View
COMPGEOM
2010
ACM
15 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
HICSS
2002
IEEE
116views Biometrics» more  HICSS 2002»
15 years 2 months ago
E-commerce Security Issues
Without trust, most prudent business operators and clients may decide to forgo use of the Internet and revert back to traditional methods of doing business. To counter this trend,...
Randy C. Marchany, Joseph G. Tront
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
ICALP
2010
Springer
15 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
CDC
2009
IEEE
148views Control Systems» more  CDC 2009»
15 years 2 months ago
Comparison of reduced order lithium-ion battery models for control applications
— Lithium-ion batteries are the core of new plug-in hybrid-electrical vehicles (PHEV) as well as considered in many 2nd generation hybrid electric vehicles (HEV). In most cases t...
Carmelo Speltino, Domenico Di Domenico, Giovanni F...