Sciweavers

2254 search results - page 392 / 451
» Computing the minimal covering set
Sort
View
TOG
2008
104views more  TOG 2008»
13 years 8 months ago
A system for high-volume acquisition and matching of fresco fragments: reassembling Theran wall paintings
Although mature technologies exist for acquiring images, geometry, and normals of small objects, they remain cumbersome and time-consuming for non-experts to employ on a large sca...
Benedict J. Brown, Corey Toler-Franklin, Diego Neh...
KAIS
2010
139views more  KAIS 2010»
13 years 8 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
PVLDB
2010
135views more  PVLDB 2010»
13 years 8 months ago
P2PDocTagger: Content management through automated P2P collaborative tagging
As the amount of user generated content grows, personal information management has become a challenging problem. Several information management approaches, such as desktop search,...
Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong ...
ICIP
2010
IEEE
13 years 8 months ago
Texture classification via patch-based sparse texton learning
Texture classification is a classical yet still active topic in computer vision and pattern recognition. Recently, several new texture classification approaches by modeling textur...
Jin Xie, Lei Zhang, Jane You, David Zhang
ICTAI
2010
IEEE
13 years 8 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
Una Benlic, Jin-Kao Hao