Sciweavers

937 search results - page 113 / 188
» On the Complexity of Partial Order Properties
Sort
View
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 8 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 10 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
ECCV
2002
Springer
16 years 8 months ago
On the Motion and Appearance of Specularities in Image Sequences
Real scenes are full of specularities (highlights and reflections), and yet most vision algorithms ignore them. In order to capture the appearance of realistic scenes, we need to ...
Rahul Swaminathan, Sing Bing Kang, Richard Szelisk...
EUROMICRO
2000
IEEE
15 years 10 months ago
Continuous Discrete-Event Simulation of a Continuous-Media Server I/O Subsystem
When designing computer systems, simulation tools are used to imitate a real or proposed system. Complex, dynamic systems can be simulated without the cost and time constraints in...
Michael Weeks, Chris Bailey, Reza Sotudeh
CAMP
2005
IEEE
15 years 11 months ago
Bio-Inspired Computing Architectures: The Embryonics Approach
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
Gianluca Tempesti, Daniel Mange, André Stau...