28888 search results - page 5484 / 5778 » Computability and complexity in analysis |
144
click to vote
ICFCA
2007
Springer
15 years 10 months ago
2007
Springer
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
123
click to vote
OOPSLA
2007
Springer
15 years 10 months ago
2007
Springer
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
138
click to vote
PAM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Tracing traffic using commodity hardware in contemporary highspeed access or aggregation networks such as 10-Gigabit Ethernet is an increasingly common yet challenging t...
138
click to vote
TELETRAFFIC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
114
click to vote
TGC
2007
Springer
15 years 10 months ago
2007
Springer
Secure information flow analysis aims to prevent programs from leaking their H (high) inputs to their L (low) outputs. A major challenge in this area is to relax the standard noni...