3471 search results - page 271 / 695 » Obstacle Numbers of Graphs |
155
click to vote
ICPP
1997
IEEE
15 years 11 months ago
1997
IEEE
Optamzztng compalataon as very amportant for generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon t...
174
click to vote
ACIIDS
2009
IEEE
15 years 10 months ago
2009
IEEE
Inter domain service routing is an element in the success of Next Generation Network. Service requests, such as the INVITE request in Session Initiation Protocol [21] may need to ...
214
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...
187
click to vote
AIRS
2006
Springer
15 years 10 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
168
click to vote
APWEB
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we will provide an overview of some of the more recent developments in web graph processing using the classic Google page rank equation as popularized by Brins and P...