14699 search results - page 413 / 2940 » Complexity and Cognitive Computing |
114
click to vote
IANDC
2007
15 years 5 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
163
click to vote
TCS
2008
15 years 5 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
146
click to vote
SAS
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
113
click to vote
ASAP
2009
IEEE
16 years 2 months ago
2009
IEEE
—We present a design and implementation of a radix-4 complex division unit with prescaling of the operands. Specifically, we extend the treatment of the residual bound and error...
136
click to vote
ICDAR
2009
IEEE
15 years 12 months ago
2009
IEEE
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...