Sciweavers

327 search results - page 33 / 66
» Comparative News Summarization Using Linear Programming
Sort
View
106
Voted
ICML
2008
IEEE
15 years 10 months ago
On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...
87
Voted
ICS
2005
Tsinghua U.
15 years 3 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
15 years 9 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
IPPS
2003
IEEE
15 years 2 months ago
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
Sethavidh Gertphol, Viktor K. Prasanna
ACTAC
2002
102views more  ACTAC 2002»
14 years 9 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely