Sciweavers

484 search results - page 53 / 97
» Large graph processing in the cloud
Sort
View
100
Voted
JOT
2010
126views more  JOT 2010»
14 years 8 months ago
Inferring design patterns using the ReP graph
Abstract Periodic refactoring of a large source code often becomes a necessity especially for long-lived projects. In order to increase maintainability and extensibility of such pr...
Tushar Sharma, Dharanipragada Janakiram
ICDAR
2009
IEEE
14 years 7 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
15 years 1 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
ADMA
2008
Springer
89views Data Mining» more  ADMA 2008»
14 years 11 months ago
Timeline Analysis of Web News Events
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
Jiangtao Qiu, Chuan Li, Shaojie Qiao, Taiyong Li, ...
86
Voted
SIGCOMM
1998
ACM
15 years 1 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam