Sciweavers

1165 search results - page 126 / 233
» Effective linear programming based placement methods
Sort
View
JMLR
2012
13 years 5 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre
AAAI
2006
15 years 4 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
SIGSOFT
2005
ACM
16 years 3 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
ICCV
2001
IEEE
16 years 5 months ago
Photometric Image-Based Rendering for Image Generation in Arbitrary Illumination
A Photometric Image-Based Rendering (PIBR) concept is proposed that facilitates the generation of an image with an arbitrary illumination. Based on this concept, we aim to generat...
Yasuhiro Mukaigawa, Hajime Miyaki, Sadahiko Mihash...
ICASSP
2011
IEEE
14 years 6 months ago
Compact support kernels based time-frequency distributions: Performance evaluation
This paper presents two new time-frequency distributions based on kernels with compact support (KCS) namely the separable CB (SCB) and the polynomial CB (PCB) TFDs. The implementa...
Mansour Abed, Adel Belouchrani, Mohamed Cheriet, B...