Sciweavers

9842 search results - page 1751 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PEPM
2010
ACM
16 years 27 days ago
Clone detection and elimination for Haskell
Duplicated code is a well known problem in software maintenance and refactoring. Code clones tend to increase program size and several studies have shown that duplicated code make...
Christopher Brown, Simon Thompson
ICPR
2010
IEEE
15 years 11 months ago
Recognizing Sign Language from Brain Imaging
The problem of classifying complex motor activities from brain imaging is relatively new territory within the fields of neuroscience and brain-computer interfaces. We report posi...
Nishant Mehta, Thad Starner, Melody Moore Jackson,...
WWW
2010
ACM
15 years 11 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 11 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
TACAS
2010
Springer
210views Algorithms» more  TACAS 2010»
15 years 11 months ago
Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors
Modern multicore processors, such as the Cell Broadband Engine, achieve high performance by equipping accelerator cores with small “scratchpad” memories. The price for increase...
Alastair F. Donaldson, Daniel Kroening, Philipp R&...
« Prev « First page 1751 / 1969 Last » Next »