Sciweavers

5595 search results - page 822 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
MST
2010
98views more  MST 2010»
15 years 5 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
CONEXT
2010
ACM
15 years 4 months ago
Profiling-By-Association: a resilient traffic profiling solution for the internet backbone
Profiling Internet backbone traffic is becoming an increasingly hard problem since users and applications are avoiding detection using traffic obfuscation and encryption. The key ...
Marios Iliofotou, Brian Gallagher, Tina Eliassi-Ra...
IS
2010
15 years 4 months ago
Building concepts for AI agents using information theoretic Co-clustering
Abstract--High level conceptual thought seems to be at the basis of the impressive human cognitive ability, and AI researchers aim to replicate this ability in artificial agents. C...
Jason R. Chen
ICFHR
2010
193views Biometrics» more  ICFHR 2010»
15 years 1 months ago
A New Method for Handwritten Scene Text Detection in Video
There are many video images where hand written text may appear. Therefore handwritten scene text detection in video is essential and useful for many applications for efficient ind...
Palaiahnakote Shivakumara, Anjan Dutta, Umapada Pa...
JCDL
2011
ACM
244views Education» more  JCDL 2011»
14 years 9 months ago
Product review summarization from a deeper perspective
With product reviews growing in depth and becoming more numerous, it is growing challenge to acquire a comprehensive understanding of their contents, for both customers and produc...
Duy Khang Ly, Kazunari Sugiyama, Ziheng Lin, Min-Y...