Sciweavers

11345 search results - page 2081 / 2269
» Foundations of Computer Science
Sort
View
CVIU
2011
14 years 6 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
ATAL
2011
Springer
14 years 2 months ago
A model of norm emergence and innovation in language change
We analyze and extend a recently proposed model of linguistic diffusion in social networks, to analytically derive time to convergence, and to account for the innovation phase of...
Samarth Swarup, Andrea Apolloni, Zsuzsanna Fagyal
CIKM
2011
Springer
14 years 2 months ago
Content-driven detection of campaigns in social media
We study the problem of detecting coordinated free text campaigns in large-scale social media. These campaigns – ranging from coordinated spam messages to promotional and advert...
Kyumin Lee, James Caverlee, Zhiyuan Cheng, Daniel ...
ECOOP
2011
Springer
14 years 2 months ago
An Empirical Study of Object Protocols in the Wild
Abstract. An active area of research in computer science is the prevention of violations of object protocols, i.e., restrictions on temporal orderings of method calls on an object....
Nels E. Beckman, Duri Kim, Jonathan Aldrich
CATA
2000
15 years 4 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
« Prev « First page 2081 / 2269 Last » Next »