Sciweavers

1133 search results - page 190 / 227
» Basics of Graph Cuts
Sort
View
EURODAC
1995
IEEE
137views VHDL» more  EURODAC 1995»
14 years 14 days ago
A formal non-heuristic ATPG approach
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...
Manfred Henftling, Hannes C. Wittmann, Kurt Antrei...
CSE
2009
IEEE
14 years 10 days ago
Analyzing Enterprise Social Media Networks
Broadening adoption of social media applications within the enterprise offers a new and valuable data source for insight into the social structure of organizations. Social media ap...
Marc A. Smith, Derek L. Hansen, Eric Gleave
CCGRID
2008
IEEE
13 years 11 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
ACL
2008
13 years 10 months ago
Summarizing Emails with Conversational Cohesion and Subjectivity
In this paper, we study the problem of summarizing email conversations. We first build a sentence quotation graph that captures the conversation structure among emails. We adopt t...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 10 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong