Sciweavers

943 search results - page 116 / 189
» How should data structures and algorithms be taught
Sort
View
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 9 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
SAC
2009
ACM
14 years 1 months ago
Discovering XML keys and foreign keys in queries
The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of their structu...
Martin Necaský, Irena Mlýnková...
BMCBI
2006
116views more  BMCBI 2006»
13 years 9 months ago
Whole genome association mapping by incompatibilities and local perfect phylogenies
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
Thomas Mailund, Søren Besenbacher, Mikkel H...
CCS
2006
ACM
14 years 1 months ago
Secure hierarchical in-network aggregation in sensor networks
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
14 years 10 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha