Sciweavers

2845 search results - page 511 / 569
» Constraints over Ontologies
Sort
View
PVLDB
2008
138views more  PVLDB 2008»
13 years 8 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 7 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
SIGSOFT
2010
ACM
13 years 7 months ago
SCORE: the first student contest on software engineering
The Student Contest on Software Engineering (SCORE), organized for the first time in conjunction with the International Conference on Software Engineering (ICSE) 2009, attracted 5...
Dino Mandrioli, Stephen Fickas, Carlo A. Furia, Me...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 5 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 3 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...