2137 search results - page 398 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
162
click to vote
FGR
2011
IEEE
14 years 5 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
120
click to vote
IEEEINTERACT
2003
IEEE
15 years 7 months ago
2003
IEEE
: The traditional framework for back-end compilation is based on the scope of functions, which is a natural boundary to partition an entire program for compilation. However, the si...
110
click to vote
CONEXT
2010
ACM
14 years 12 months ago
2010
ACM
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
124
click to vote
ECML
2007
Springer
15 years 8 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
104
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...