Sciweavers

2127 search results - page 254 / 426
» Computing large matchings fast
Sort
View
HPDC
2003
IEEE
15 years 9 months ago
Flexible Information Discovery in Decentralized Distributed Systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
Cristina Schmidt, Manish Parashar
GRAPHICSINTERFACE
2009
15 years 2 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
CVPR
2012
IEEE
13 years 6 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 9 months ago
A genetic algorithm to improve linux kernel performance on resource-constrained devices
As computers become increasingly mobile, users demand more functionality, longer battery-life, and better performance from mobile devices. In response, chipset fabricators are foc...
James Kukunas, Robert D. Cupper, Gregory M. Kapfha...
OOPSLA
1997
Springer
15 years 8 months ago
Efficient Type Inclusion Tests
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
Jan Vitek, R. Nigel Horspool, Andreas Krall