Sciweavers

749 search results - page 89 / 150
» Scenario based Analysis of Linear Computations
Sort
View
146
Voted
IPPS
2009
IEEE
15 years 10 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
115
Voted
MP
2010
94views more  MP 2010»
15 years 2 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
140
Voted
ICIP
2005
IEEE
16 years 5 months ago
Nonlinear dimensionality reduction for classification using kernel weighted subspace method
We study the use of kernel subspace methods that learn low-dimensional subspace representations for classification tasks. In particular, we propose a new method called kernel weigh...
Guang Dai, Dit-Yan Yeung
146
Voted
SIGMOD
2005
ACM
153views Database» more  SIGMOD 2005»
16 years 3 months ago
Multiple Aggregations Over Data Streams
Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. The need for exploratory IP traffic data analysis naturally leads ...
Rui Zhang 0003, Nick Koudas, Beng Chin Ooi, Divesh...
156
Voted
AI
2002
Springer
15 years 3 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...