Sciweavers

356 search results - page 49 / 72
» A Most General Edge Elimination Polynomial - Thickening of E...
Sort
View
POPL
2007
ACM
16 years 23 days ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
133
Voted
IEEEPACT
2008
IEEE
15 years 6 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
ISCIS
2005
Springer
15 years 6 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
102
Voted
ICAIL
2009
ACM
15 years 5 months ago
The network of French legal codes
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
Pierre Mazzega, Danièle Bourcier, Romain Bo...
102
Voted
PAMI
2008
302views more  PAMI 2008»
15 years 12 days ago
Learning to Detect Moving Shadows in Dynamic Environments
We propose a novel adaptive technique for detecting moving shadows and distinguishing them from moving objects in video sequences. Most methods for detecting shadows work in a stat...
Ajay J. Joshi, Nikolaos Papanikolopoulos