Sciweavers

243 search results - page 8 / 49
» Small Is Not Always Beautiful
Sort
View
DATASCIENCE
2008
79views more  DATASCIENCE 2008»
13 years 8 months ago
Report from the first Workshop on Extremely Large Databases
Industrial and scientific datasets have been growing enormously in size and complexity in recent years. The largest transactional databases and data warehouses can no longer be ho...
Jacek Becla, Kian-Tat Lim
MSS
2008
IEEE
82views Hardware» more  MSS 2008»
13 years 7 months ago
Revealed preference and indifferent selection
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
Eric Danan
INFOCOM
2012
IEEE
11 years 10 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 2 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
JSYML
1998
61views more  JSYML 1998»
13 years 7 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah