Sciweavers

159 search results - page 9 / 32
» Open Problems from CCCG 2008
Sort
View
COMSWARE
2008
IEEE
13 years 9 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
COR
2007
163views more  COR 2007»
13 years 7 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
BSL
2008
100views more  BSL 2008»
13 years 7 months ago
Hyperlinear and Sofic Groups: A Brief Guide
This is an introductory survey of the emerging theory of two new classes of (discrete, countable) groups, called hyperlinear and sofic groups. They can be characterized as subgroup...
Vladimir Pestov
IEEEARES
2008
IEEE
14 years 1 months ago
Using Non-adaptive Group Testing to Construct Spy Agent Routes
We consider a network of remote agent platforms that are tested by roaming spy agents in order to identify those that are malicious, based on the outcome of each agent. It is show...
Georgios Kalogridis, Chris J. Mitchell
CSUR
2000
101views more  CSUR 2000»
13 years 7 months ago
Extracting usability information from user interface events
to extract information at a level of abstraction that is useful to investigators interested in analyzing application usage or evaluating usability. This survey examines computer-ai...
David M. Hilbert, David F. Redmiles